-
1 conditional halting
Большой англо-русский и русско-английский словарь > conditional halting
-
2 conditional halting
Вычислительная техника: условный останов -
3 conditional halting
Англо-русский словарь по робототехнике > conditional halting
-
4 conditional
обусловленное поведение
– conditional branch
– conditional branching test
– conditional expression
– conditional fork
– conditional halt
– conditional halting
– conditional instruction
– conditional minimum
– conditional probability
– conditional stability
– conditional statement
– conditional stop
– conditional transfer
-
5 conditional breakpoint
условный останов; условный переходbreakpoint symbol — знак останова; знак прерывания
-
6 instruction
1) руководство; программа ( действий); инструкция2) вчт. команда; управляющий сигнал3) обучение; инструктаж ( персонала)•- automated instruction
- automatic control halting instruction
- automatic operation halting instruction
- binary code instruction
- binary coded instruction
- branching instruction
- breakpoint instruction
- call instruction
- calling instruction
- centering instruction
- command instruction
- compare instruction
- computer instruction
- computer-aided instruction
- computer-assisted instruction
- computer-generated instructions
- conditional breakpoint instruction
- conditional jump instruction
- conditional transfer instruction
- control instruction
- depth-measuring instruction
- diameter-measuring instruction
- dummy instruction
- erase instruction
- exit instruction
- extract instruction
- ignore instruction
- immediate address instruction
- immediate instruction
- installation instruction
- jump instruction
- lubricating instruction
- machine address instruction
- machine code binary instruction
- machine control instructions
- machine instruction
- machine language instruction
- machine setup instructions
- machining instruction
- macro instruction
- management instruction
- measuring instruction
- menu-driven instruction
- multiaddress instruction
- multimedia work instructions
- NC instruction
- numerical-controlled instruction
- on-screen instruction
- optional halt instruction
- optional pause instruction
- optional stop instruction
- parameter-setting instruction
- picking instruction
- positioning instruction
- program instruction
- programmed instruction
- repeat instruction
- repetition instruction
- repetitive instruction
- reset instruction
- routing instruction
- sampling instruction
- service instruction
- setup instruction
- spindle rotation instruction
- step-by-step instructions
- tool selection instruction
- user instruction
- verbal instruction
- working instructionEnglish-Russian dictionary of mechanical engineering and automation > instruction
-
7 tentative
1. n попытка, опыт, эксперимент; пробаtentative comparability — попытка сопоставления; попытка сравнения
2. a пробный, опытный, экспериментальный; ориентировочный3. a гипотетический, предполагаемый4. a предварительный; временный5. a нерешительный, неуверенныйСинонимический ряд:1. alternate (adj.) alternate; alternative; substitute; surrogate2. conditional (adj.) conditional; dependent; experimental; indefinite; pilot; probationary; provisional; provisionary; provisory; qualified; temporary; trial3. rough (adj.) preliminary; rough; sketchy; unfinished; unperfected; unpolished4. vacillating (adj.) double-minded; doubtful; faltering; halting; hesitant; hesitating; indecisive; irresolute; pendulous; shilly-shally; shilly-shallying; timid; uncertain; undecisive; unresolved; vacillant; vacillating; vacillatory; wavering; weak-kneed; whiffling; wiggle-waggle; wobblyАнтонимический ряд:definite; definitive; final; permanent; sure -
8 expression-true breakpoint
breakpoint symbol — знак останова; знак прерывания
conditional breakpoint — условный останов; условный переход
English-Russian dictionary of Information technology > expression-true breakpoint
См. также в других словарях:
Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… … Wikipedia
Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Compiler optimization — is the process of tuning the output of a compiler to minimize or maximize some attributes of an executable computer program. The most common requirement is to minimize the time taken to execute a program; a less common one is to minimize the… … Wikipedia
Computability — You might be looking for Computable function, Computability theory, Computation, or Theory of computation. Computability is the ability to solve a problem in an effective manner. It is a key topic of the field of computability theory within… … Wikipedia
Counter machine — A counter machine is an abstract machine used in formal logic and theoretical computer science to model computation. It is the most primitive of the four types of register machines. A counter machine comprises a set of one or more unbounded… … Wikipedia
Post–Turing machine — The article Turing machine gives a general introduction to Turing machines, while this article covers a specific class of Turing machines. A Post–Turing machine is a program formulation of an especially simple type of Turing machine, comprising a … Wikipedia
computer — computerlike, adj. /keuhm pyooh teuhr/, n. 1. Also called processor. an electronic device designed to accept data, perform prescribed mathematical and logical operations at high speed, and display the results of these operations. Cf. analog… … Universalium
Maude system — The Maude system is an implementation of rewriting logic developed at SRI International. It is similar in its general approach to Joseph Goguen s OBJ3 implementation of equational logic, but based on rewriting logic rather than order sorted… … Wikipedia
Algorithmic efficiency — In computer science, efficiency is used to describe properties of an algorithm relating to how much of various types of resources it consumes. Algorithmic efficiency can be thought of as analogous to engineering productivity for a repeating or… … Wikipedia
History of logic — Philosophy ( … Wikipedia
